Prototype Implementation Based on the Machine Shop Information Model
نویسندگان
چکیده
Interoperability between manufacturing software applications and simulation is currently extremely limited. A machine shop information model has been developed at the National Institute of Standards and Technology (NIST) as a part of system interoperability efforts. The primary objective is to develop a standard-data-interface structure for exchanging shop data among various manufacturing software applications, including simulation. The information model, when completed, will satisfy the following needs: 1) to support data requirements for the entire simulation of manufacturing life cycle, 2) to enable data exchange between simulation and other manufacturing software for machine shops, 3) to provide for the construction of machine shop simulators, and 4) to support testing and evaluation of machine shops’ manufacturing software. The model is presented in both graphical form, in UML (Unified Modeling Language), and textual form, in XML (eXtensible Markup Language). The interface data include organizations, calendars, work, resources, schedules, parts, and process plans within a machine shop environment. To facilitate the implementation of the machine shop information model, custom-built software programs are being developed at NIST. The development of these software applications has been executed using document object model, XML path language, open database connectivity database engine, and machine shop information model’s C++ data structures. A graphical user interface (GUI) system has also been generated to execute various functions, such as import, export, translator execution, and simulation execution. This paper presents research activities performed at NIST to support the implementation of the machine shop information model. Topics included in this paper are database development, parsers and translator development, prototype implementation, and standardization.
منابع مشابه
A Mathematical Model for a Flow Shop Scheduling Problem with Fuzzy Processing Times
This paper presents a mathematical model for a flow shop scheduling problem consisting of m machine and n jobs with fuzzy processing times that can be estimated as independent stochastic or fuzzy numbers. In the traditional flow shop scheduling problem, the typical objective is to minimize the makespan). However,, two significant criteria for each schedule in stochastic models are: expectable m...
متن کامل1 Data Transfer Strategy for Machine Shop Simulation
Manufacturing simulation systems normally provide interfaces for data import and export using proprietary formats. Dependent data interfaces limit simulation applications in the manufacturing industry. This paper describes a mechanism for transferring data between a traditional database and XML files, which represent a machine shop data model developed at the National Institute of Standards and...
متن کاملCustomer Order Scheduling with Job-Based Processing and Lot Streaming In A Two-Machine Flow Shop
This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders f...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005